Simple Euclidean Arrangements with No (>= 5)-Gons
نویسندگان
چکیده
It is shown that if a simple Euclidean arrangement of n pseudolines has no (≥ 5)–gons, then it has exactly n − 2 triangles and (n − 2)(n − 3)/2 quadrilaterals. We also describe how to construct all such arrangements, and as a consequence we show that they are all stretchable.
منابع مشابه
On Inducing n-gons
In this paper, we establish a lower bound on the number of inducing simple n-gons in grid-like arrangements of lines. We also show that the complexity associated with counting the number of inducing n-gons in an arrangement of collinear segments is #P-complete.
متن کاملThe minimum area of a simple polygon with given side lengths
Answering a question of H. Harborth, for any given a1, ..., an > 0, satisfying ai < ∑ j 6=i aj we determine the infimum of the areas of the simple n–gons in the Euclidean plane, having sides of length a1, ..., an (in some order). The infimum is attained (in limit) if the polygon degenerates into a certain kind of triangle, plus some parts of zero area. We show the same result for simple polygon...
متن کاملOn the Perimeters of Simple Polygons Contained in a Plane Convex Body
A simple n-gon is a polygon with n edges such that each vertex belongs to exactly two edges and every other point belongs to at most one edge. Brass, Moser and Pach [2, Problem 3, p. 437] asked the following question: For n ≥ 5 odd, what is the maximum perimeter of a simple n-gon contained in a Euclidean unit disk? In 2009, Audet, Hansen and Messine [1] answered this question, and showed that t...
متن کاملTriangles in Euclidean Arrangements
The number of triangles in arrangements of lines and pseudolines has been object of some research Most results however concern arrangements in the projective plane In this article we add results for the number of triangles in Euclidean arrange ments of pseudolines Though the change in the embedding space from projective to Euclidean may seem small there are interesting changes both in the resul...
متن کاملWhich n-Venn diagrams can be drawn with convex k-gons?
We establish a new lower bound for the number of sides required for the component curves of simple Venn diagrams made from polygons. Specifically, for any n-Venn diagram of convex k-gons, we prove that k ≥ (2 − 2 − n)/(n(n − 2)). In the process we prove that Venn diagrams of seven curves, simple or not, cannot be formed from triangles. We then give an example achieving the new lower bound of a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 38 شماره
صفحات -
تاریخ انتشار 2007